Topology control in large-scale wireless sensor networks: Between information source and sink
نویسندگان
چکیده
With non-uniform traffic patterns in wireless sensor networks due to the many-to-one nature of communications, the traditional definition of connectivity in graph theory does not seem to be sufficient to satisfy the requirements of sensor networks. In this work, a new notion of connectivity (called path-implementability) is defined which represents the ability of sensor nodes to relay traffic along a given direction field (referred to as information flow vector field) ~D. The magnitude of information flow is proportional to the traffic flux (per unit length) passing through any point in the network, and its direction is toward the flow of traffic. The flow field may be obtained from engineering knowledge or as a solution to an optimization problem. In either case, information flow flux lines are abstract paths that are assumed to represent desired paths for flow of traffic. In a sensor network with a given flow field ~Dðx; yÞ, we show that a density of nðx; yÞ 1⁄4 Oðj~Dðx; yÞjÞ sensor nodes is not sufficient to implement the flow field. On the other hand, by increasing the density of wireless nodes to nðx; yÞ 1⁄4 Oðj~Dðx; yÞj log j~Dðx; yÞjÞ, the flow field becomes path-implementable. Path-implementability requires more nodes than simple connectivity. However, it guarantees existence of enough paths connecting the information source to the sink so that all the traffic can be transmitted to the sink. We also propose a joint MAC and routing protocol to forward traffic along the flow field; the proposed tier-based scheme can be further exploited to build lightweight protocol stacks which meet the specific requirements of dense sensor networks. 2012 Elsevier B.V. All rights reserved.
منابع مشابه
Quasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks
Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...
متن کاملA multiple criteria algorithm for planning the itinerary of mobile sink in wireless sensor networks
The mobile sink can increase the efficiency of wireless sensor networks. It moves in a monitored environment and collects the network nodes information. Thus, by the sink we can balance the power consumption and increases the network lifetime. Determining path of the sink's movement is usually modeled as an optimization problem where finding optimal solutions require collecting value of all the...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملEnergy-Saving in Wireless Sensor Networks Based on Optimization Sink Movement Control
A sensor network is made up of a large number of sensors with limited energy. Sensors collect environmental data then send them to the sink. Energy efficiency and thereby increasing the lifetime of sensor networks is important. Direct transfer of the data from each node to the central station will increase energy consumption. Previous research has shown that the organization of nodes in cluster...
متن کاملSink Location Service Based on Fano Plane in Wireless Sensor Networks
Sink location is considered as a basic service in geographic routing in wireless sensor networks. Obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. In this paper, a sink location algorithm based on Fano plane is proposed. The research challenge is how to ensure the intersection of two SLQ (Location Q...
متن کاملClassification and Comparison of Methods for Discovering Coverage Loss Areas in Wireless Sensor Networks
In recent years, wireless sensor networks data is taken into consideration as an ideal source, in terms of speed, accuracy and cost, in order to study the Earth's surface. One of the most important challenges in this area, is the signaling network coverage and finding holes. In recent years, wireless sensor networks data is taken into consideration as an ideal source, in terms of speed, accurac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ad Hoc Networks
دوره 11 شماره
صفحات -
تاریخ انتشار 2013